A Multiple Knapsack Approach for Assignment Problem of Human Resources

In this paper, we propose the assignment problem of resources humans’ methodology by using the multiple knapsack approach to formulate the studied problem, and solve it by using the genetic algorithm for obtaining the optimal assignment of the new qualified employees that ensures the maximization the productivity by introducing constraints corresponding to the cost of each posts, and capacity of personnel in each service of enterprise. The personnel selected can be transferred and diversifying their competencies and qualifications. This study of this problem allows the managers of human resources to manage the recruitment of qualified employees to occupy the posts in of enterprise for improving the productivity. The multiple knapsack problems (MKP) is a more complex variant of the 0–1 knapsack problem, an NP-Hard problem So, our problem is difficult combinatorial problems Finally, a detailed algorithm based on the GA will be presented as a method of solving our problem with a numerical example to valid this work.